Adaptive Grid Decomposition Algorithm based on Standard Deviation Circle Radius
نویسندگان
چکیده
منابع مشابه
An Adaptive Sweep-Circle Spatial Clustering Algorithm Based on Gestalt
An adaptive spatial clustering (ASC) algorithm is proposed in this present study, which employs sweep-circle techniques and a dynamic threshold setting based on the Gestalt theory to detect spatial clusters. The proposed algorithm can automatically discover clusters in one pass, rather than through the modification of the initial model (for example, a minimal spanning tree, Delaunay triangulati...
متن کاملDynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملThe Analysis of Iran Cotton Producers’ Risk Degree Based on Non-Linear Mean-Standard Deviation Model
As regards decreasing cotton cultivation in Iran during these years, the degree of risk taken by a cotton cultivator in the agricultural part is important. The studies showed that the cotton crop yield during the past years did not have enough growth and the cotton cost product in the period of study cotton production costs, has increased. In this paper, the risk orientation of cotton cultivato...
متن کاملPareto Adaptive Decomposition algorithm
Dealing with multi-objective combinatorial optimization and local search, this article proposes a new multi-objective meta-heuristic named Pareto Adaptive Decomposition algorithm (PAD). Combining ideas from decomposition methods, two phase algorithms and multi-armed bandit, PAD provides a 2-phase modular framework for finding an approximation of the Pareto front. The first phase decomposes the ...
متن کاملA Grid-based Clustering Algorithm using Adaptive Mesh Refinement
Clustering analysis, an automatic process to find similar groups of objects from a database, has been studied for many years. With the increasing data size generated recently, clustering large databases poses a challenging task that must satisfy both the requirements of the computation efficiency and result quality. Among the existing clustering algorithms, grid-based algorithms generally have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Performability Engineering
سال: 2019
ISSN: 0973-1318
DOI: 10.23940/ijpe.19.08.p14.21452152